Encoding method having improved interleaving

ABSTRACT

A method of encoding at least one input bit set of ordered bits with permutation position integers comprising encoding the input bit set using a first encoder having a multi-state register to provide a first output; selectively reordering the input bit set using an interleaver to provide a reordered input bit set; and encoding the reordered input bit set using a second encoder having a multi-state register to provide a second output; whereby the value of said second encoder register is the same as the value of said first encoder register upon completion of the procedure.

CROSS REFERENCE TO RELATED APPLICATIONS

[0001] This application is a continuation of Application Ser. No. 09/806,202, filed Mar. 27, 2001 which is a Section 371 National Phase of PCT/US99/24066, filed Oct. 12, 1999 which claims priority from Provisional Application No. 60/112,318, filed Dec. 14, 1998 and Provisional Application No. 60/104,040, filed Oct. 13, 1998.

BACKGROUND OF THE INVENTION

[0002] 1. Field of the Invention

[0003] The present invention relates generally to processes that create time diversity in systems with high processing gain. More specifically, the invention relates to a system and method of turbo code interleaving mapping where the number of tail bits required to flush the storage registers of each constituent encoder to an all-zero state are reduced.

[0004] 2. Description of the Prior Art

[0005] In many types of data communication systems, whether voice or non-voice, signal diversity or redundancy when transmitting information is shown to improve performance without compromising other aspects of the data transmission system. Two techniques that add time diversity are known as interleaving and forward error-correcting (FEC) coding.

[0006] The process of interleaving is where the input data sequence is permuted or reordered into another sequence. For example:

[0007] where the mathematical operator I_(N)[J] transposes the original position of each bit or symbol of a finite input sequence to a new position J by operation of the interleaver I_(N). This reordering process that achieves time diversity is called interleaving and can be performed in a number of ways. Two methods of typical interleaving are known as block and random interleaving.

[0008] At the transmission destination, the signal is again reordered, putting the data sequence back in the original order. The inverse process is called deinterleaving.

[0009] The most recent advance in coding techniques which exhibit the best performance are turbo codes. A variety of turbo code interleaver designs exist and require less complexity when decoding. The three most popular are: 1) block interleavers; 2) pseudo-random interleavers; and 3) S-random interleavers.

[0010] The best performing interleavers are the S-random interleavers. The S-random interleavers exploit the property of not mapping neighbor positions within a certain sequence length, to neighbor positions exhibiting the same length. This makes the sequence length as large as possible. All interleaver designs require a specific set of rules setting forth input sequence size and permutation.

[0011] In conjunction with interleaving, FEC coding improves performance for signals that are coherently demodulated. FEC coding adds additional redundancy in the original data sequence. In communication systems that communicate over a spread spectrum air interface, redundancy is already present in the shared spectral transmission channel. A FEC encoder is a finite-state machine that relies upon nodes or states and delay registers. The predetermined transitions between the registers define a path from which a given data input may produce an output. A common way to illustrate the encoding and decoding technique for the convolutionally encoded data is the use of a trellis diagram which is known to those familiar with this art. A trellis diagram is an infinite replication of a state machine diagram and is shown in FIG. 1.

[0012] The decoding is typically performed using a maximum likelihood algorithm which relies upon the trellis structure and the path state or metric for each level and each selected node or state. Any code word of a convolutional code corresponds to the symbols along a path in the trellis diagram. At each state and at each level of the trellis an add-compare-select operation is performed to select the best path and state. The trellis is assembled over many received symbols. After a predefined number of symbols have been accumulated, the determination finds the trellis path with the smallest error. The final decision on all bits in the trellis is made via the encoders by forcing the encoder to return to an initial all-zero state. This is achieved by inserting zero tail bits at the end of the finite bit stream after encoding. This process is referred to as “tailing off.”

[0013] A process known as “chaining back” is performed starting at the last node, tracing the decision path back from the last decision to the first. This method of decoding determines which symbol was originally sent. The trellis structure introduces redundancy and accumulates past history.

[0014] A prior art turbo encoder is shown in FIG. 2. The encoder comprises first and second systematic recursive convolutional code (RCS) encoders coupled in parallel with a turbo code interleaver coupled prior to the second recursive convolutional encoder. The two recursive convolutional codes used in each encoder are known as the constituent codes. The first encoder reorders the input information bits

_(N) in their original order while the second encoder reorders the input bits as permuted by the turbo code interleaver

x^(I) _(N). The input information sequence

x_(N) is always transmitted through a channel. In dependence upon the data transmission rate, the outputs from both encoders may be “punctured” before transmission

y_(N). Puncturing is a process where alternate outputs of the lower taps (first and second encoders

p¹ _(N),

p² _(N)) are deleted from the output. This process establishes a code rate.

[0015] The turbo code interleaver is a scrambler defined by a permutation of the sequence length with no repetitions. A complete sequence is input into the interleaver and output in a predefined order.

[0016] A prior art tailing off process is shown and described in FIGS. 3 and 4. The tail bits for each encoder are obtained from register feedback from each respective encoder as shown in FIG. 3. Since the register contents of each constituent encoder are different at the beginning of the tailing off operation, each encoder must be flushed separately. As described in FIG. 4, each encoder (in FIG. 3) is flushed independently and exclusive of each other after the information bits have been encoded. Each encoder derives and receives its own tail bits. Therefore, if m equals the number of states or register memory of an encoder, m tail bits are required for one encoder and 2m are required for both encoders.

[0017] A prior art turbo code decoder is shown in FIG. 5. On receiving the demodulated soft value signal

y_(N), the soft-decision information for the systematic (information) and parity bits

p¹ _(N) from the first constituent encoder are input to a first constituent decoder. The first constituent decoder generates updated, soft-decision likelihood values

L_(e1) (

x_(N)) for the information bits that are input along with the information bits to a decoder interleaver. The input to a second constituent decoder includes the interleaved soft-valued sequences

x^(I) _(N) and

L^(I) _(e1) (

x_(N)) and the parity bits

p² _(N) from the second constituent encoder. The output of the second decoder improves on the soft-decision likelihood values derived from the output from the first constituent decoder and is fed back to the first constituent decoder after reordering in accordance with the turbo decoder interleaver as an iterative process. The output

x^(e) from the second constituent decoder is obtained after the decoding operation is completed.

[0018] As discussed above, the use of a turbo code interleaver requires that coding be performed on a finite sequence length. To encode such a finite information sequence, it is necessary for both constituent RSC encoders in the turbo encoder to start and end in an all zero-state with the same trellis bits. Most prior art turbo encoders have their information sequences terminated with a plurality of tail bits. Tail bits are considered a nuisance and as overhead of the turbo encoded sequence.

[0019] The difficulties with flushing turbo code encoders and bringing their trellises back to their initial state have long been recognized by the prior art. For example, the article entitled Turbo Code Termination And Interleaver Conditions by Blackert et al., the article entitled Turbo Codes For PSC Applications by Divsalar et al., and the article entitled Terminating The Trellis Of Turbo-Codes In The Same State by Barbulescu et al. recognize the problems inherent in bringing the trellises of multiple encoders back to their initial states. However, none of these prior art solutions provide a suitable method for bringing the trellises of multiple encoders back to their initial state without reduction in the efficiency of the encoder.

[0020] Accordingly, there exists a need for a turbo code interleaver that does not require a plurality of tail bits to force each constituent encoder to an all-zero state.

SUMMARY OF THE INVENTION

[0021] The present invention relates to a turbo code hybrid interleaver having recursive systematic constituent encoders. The system and process encodes a finite frame of bits without requiring a plurality of tail bits to flush the registers of each encoder to an all- zero state. The hybrid interleaver reduces the turbo code overhead by using the same tail bits for both constituent encoders improving the performance of the best turbo interleaver.

[0022] Accordingly, it is an object of the present invention to provide a system and method of interleaving that does not require a plurality tail bits to be part of the encoding process.

[0023] It is a further object of the invention to eliminate the unnecessary overhead in the turbo code encoding sequence limiting the number of tail bits that terminate the encoding process to an all-zero state with a single m-bit tail where m is the number of storage registers in each constituent encoder.

[0024] Other objects and advantages of the system and the method will become apparent to those skilled in the art after reading the detailed description of the preferred embodiment.

[0025] BRIEF DESCRIPTION OF THE DRAWINGS

[0026]FIG. 1 is a prior art trellis diagram for a 4 state RSC encoder.

[0027]FIG. 2 is a system diagram of a prior art, turbo code encoder.

[0028]FIG. 3 is a system diagram of a prior art, four state encoder showing tailing off.

[0029]FIG. 4 is a flowchart of a prior art method of tailing off.

[0030]FIG. 5 is a system diagram of a prior art, turbo code decoder.

[0031]FIG. 6 is a system diagram of a turbo code encoder with a hybrid interleaver employing the system and method of the present invention.

[0032]FIG. 7 is a flowchart of the interleaver method embodying the present invention.

[0033]FIG. 8 is a 16 frame size interleaving sequence produced by the present invention for a 4 state turbo code encoder with S equal to 2 and L equal to 4.

[0034]FIG. 9 is the mapping of the interleaving sequence of FIG. 8.

[0035]FIG. 10 is the 16 frame size interleaving sequence of FIG. 8 verified.

[0036]FIG. 11 is a flowchart of the tailing off method embodying the present invention.

[0037]FIG. 12 is a flowchart of an alternative embodiment.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0038] A turbo code encoder 17 with a hybrid interleaver 19 taught in accordance with the present invention as shown in FIG. 6 terminates the first 21 and second 23 RCS constituent encoders to an all-zero state using a single tailing off bit operation 25. The present invention 17 exploits the cyclic property of each constituent encoder 21, 23 in conjunction with keeping the performance of the best turbo interleavers. The turbo code encoder 17 with hybrid interleaver 19 reduces additional tail bit overhead necessary for trellis termination of each constituent encoder 21, 23.

[0039]FIGS. 6 and 7, describe the system and process of the hybrid turbo code interleaver 19. The process 51 begins (step 53) by receiving a sequence of input data 27 for encoding. The encoding sequence frame size N is chosen (step 55). The state size and puncturing rate (code rate) are independent of the hybrid interleaver 19. The hybrid interleaver 19 generates the random integers I(k) for permutation (step 57).

[0040] As shown in FIGS. 8 and 9, the generation of the random integer sequence is performed bit by bit for each frame 29 position 31 _(1−N). The generation of a random integer (step 57) denoted as I(k) is:

1>I(k)<N  Equation (1)

[0041] where k=1, 2 , . . . , N for each mapped 33 position 35 _(1−N) in the interleaver sequence. The current selection, I(k) must meet conditions A (step 59), B (step 63) and C (step 65) as follows.

Condition A:|I(k)−I(k−j)|>S  Equation (2)

[0042] where

0<j<S  Equation (3)

[0043] and

k−j≧0.  Equation (4)

[0044] Condition A Equation (2) represents the properties of S-random interleavers. S is an arbitrary value.

Condition B: I(k)−I(k−n·L)|≠j·L  Equation (5)

[0045] (step 63) where n and j are positive integers subject to:

k−n·L≧0;  Equation (6)

[0046] and

n·L≦S  Equation (7)

[0047] (step 61)

[0048] L is determined by the constituent encoder used in the turbo code encoder. As an example, L=7 is used in an eight state turbo encoder.

Condition C: k mod 2^(m−)1=I(k)mod 2^(m)−1∀k  Equation (9)

[0049] (step 65) where m is the size of memory in the constituent encoder. For 4 and 8 state encoders, m equals 2 and 3 respectively. The above steps are repeated until all of the integers, I_(k)(for k=1, 2 , . . . , N, (step 66) for the hybrid interleaver 19 are selected (step 67) and output (step 69).

[0050] An example of the above system and method is shown in FIGS. 8, 9 and 10. A sequence frame size of 16 using a 4 state turbo code encoder 17 with hybrid interleaver 19 with S equal to 2 and L equal to 4 is shown permuted in accordance with the teachings of the invention. The hybrid interleaver 19 satisfies Conditions A and B. The hybrid interleaver 19 output 37 is verified in FIG. 10 using Condition C such that after dividing the index of an input 27 information sequence by 2^(m)−1, the resulting remainder sequence 39A is equal to the corresponding remainder sequence 39B due to the interleaving mapping index 33. Once the turbo code hybrid interleaver 19 is specified 51, the information bits 27 are permuted according the hybrid interleaver 19 in order for the second 23 constituent encoder to receive the output 37.

[0051] The process of the present invention that terminates the trellis using the same tail bits for the first 21 and second 23 constituent encoders is shown and described in FIGS. 6 and 11. As described above, the information bits are encoded by both encoders. The first 21 constituent encoder operates on the information bits 27 in their original order. The second 23 constituent encoder operates on the information bits 27 as permuted 37 according to the hybrid interleaver 19. The output from the first 21 and second 23 constituent encoders are punctured and multiplexed producing an output (see FIG. 2).

[0052] The trellis termination process 81 using the same tail bits for both constituent encoders starts (step 83) with acknowledging that all of the information bits have been encoded by the first 21 and second 23 constituent encoders. At this time in the encoding process, the register contents of both encoders are the same. The first 21 and second 23 encoders switch inputs from the original information 27 and permuted 37 bit streams to feedback 41 from the first 21 encoder. The puncturing of the first 21 encoder output

p¹ _(N) and the second 23 output

p² _(N) with the information output

x_(N) for the tailing off process is the same as during the encoding 21, 23 of the information bits 27, 37. After both switches 43,45 transition, the first 21 encoder receives tail bits from its own register via the feedback 41 (step 85). The tail bits to the second 23 encoder have not been interleaved by the hybrid interleaver 19 and are the same tail bits 41 for trellis termination as in the first 21 encoder (step 87).

[0053] For a M state encoder, log₂ M tail bits are required to flush all of the registers in the first 21 and second 23 encoders to an all-zero state. With L=log₂ M, Table 1 shows the required number of tail bits and the total number of tail coded symbols for a 4 and 8 state encoder. TABLE 1 Total coded Total coded bits bits at tail part at tail part (present L (prior art) invention) 8-state ½ rate Turbo code 3 2 × 6 = 12 6 encoder ⅓ rate Turbo code 3 2 × 9 = 18 9 4-state ½ rate Turbo code 2 2 × 4 = 8  4 encoder ⅓ rate Turbo code 2 2 × 6 = 12 6

[0054] For a ½ rate and ½ rate turbo code encoder with four (4) state constituent encoders, the present invention 17 eliminates 4 and 6 tail bits, respectively. For a ½ rate and ⅓ rate turbo code encoder with eight (8) state constituent encoders, the present invention 17 eliminates 6 and 9 tail bits, respectively, as compared to and required by the prior art.

[0055] The turbo code encoder with the hybrid interleaver yields better performance than prior art S-random interleavers since the rules stated in Condition B avoids worst case low weight distribution of the turbo codes while Condition A retains the best characteristics. Since the hybrid interleaver 19 leads to the same trellis state sequences for both the first 21 and second 23 constituent decoders at the beginning of the tail part, the use of a single m-bit tail sequence to flush both the first 21 and second 23 encoders to an all-zero state is acceptable. The extrinsic information

L^(I) _(e1) including tail bits generated from the first constituent decoder are passed on to the second constituent decoder which increases to overall performance (see FIG. 5). As an example, if the original information sequence is

[0056]

x_(N)={1 0 1 1 0 1 0 0 0 1 1 1 0 1 0 1}.

[0057] The permuted information sequence according to the hybrid interleaver 19 is

[0058]

x^(I) _(N)={0 0 0 1 0 1 1 1 1 0 1 0 1 0 1 }.

[0059] The information sequence is encoded by the first 21 and second 23 constituent encoders. The first 21 constituent encoder operates on the input

x in its original order, while the second 23 constituent encoder operates on the permuted

x^(I) interleaver 19 output.

[0060] The trellis state sequence obtained from the first 21 encoder is

[0061] {2 3 3 3 1 0 0 0 0 2 1 0 0 2 3 3 1 0}.

[0062] The trellis state sequence obtained from the second 23 encoder is

[0063] {0 00 2 3 3 3 3 3 1 0 0 2 3 3 3 1 0}.

[0064] As shown above, the last two states (four bits) from each trellis state sequence are the same due to the hybrid interleaver 19. This allows the first 21 and the second 23 constituent encoders to receive the same tail bits leading to the reduced overhead of the turbo coding process.

[0065] Condition C leads the trellis state of two constituent encoders to be the same after encoding information bits. This allows the same tail bits for both constituent encoders, resulting in the reduction of turbo-code overhead due to tail bits. In addition, using the same tail bits is desirable for an interative decoder as previously explained in which the interleaver design was based on a S-random interleaver. While the present invention improves turbo- code performance, its memory requirement is the same as for the S-random interleaver with the memory storage requirement proportional to the interleaver size.

[0066] An alternative embodiment is described in FIG. 12.

[0067] Let D denote the information sequence of binary bits with block size N such that:

D={d₁,d₂, . . . , d_(N)} where d_(k)=±1  Equation (10)

[0068] Given a M-state turbo-coder where M is equal to 4 or 8, we can partition the information sequence, D, into p-disjoint subsets, S, where p=M−1 as follows: $\begin{matrix} \left. {{{{S\quad o} = \left\{ d_{k} \right.}},{{k\quad {mod}\quad p} = 0}} \right\} & \text{Equation~~(11)} \\ {\left. {{{S_{1} = \left\{ d_{k} \right.}},{{k\quad {mod}\quad p} = 1}} \right\} \quad \vdots} & \text{Equation~~(12)} \\ \left. {{{S_{p - 1} = \left\{ d_{k} \right.}},{{k\quad {mod}\quad p} = {p - 1}}} \right\} & \text{Equation~~(13)} \end{matrix}$

[0069] where p is set to be 3 and 7 for 4-state and 8-state turbo codes, respectively. The above partition method is similar to the above coset partitioning. The value of p for each state Turbo-code is specified.

[0070] Each subset has the block size of └N/p┘ where └N/p┘ denotes the smallest integer value larger than or equal to N/p. Each subset is permuted by the use of any interleaver mapping. Then we combine all the individual subsets in order to obtain the entire interleaver output, denoted as I, as follows: Count=0; for k=1: Block size of subset for i=1:P if i=p I(count)=S₀(k) else I(count)=S_(i)(k) end if count=count + 1 if count=N exit end end

[0071] where S_(i)(k) is the k^(th) interleaved output bit of the subset S₁ and S₀(k) is the k^(th) interleaved output bit of the subset S₀. The above mentioned procedures including partition and combining subsets can be re-illustrated by using a block interleaver with └N/p┘ rows and p columns as follows:

[0072] 1) The information bits are stored row-wise in the block interleaver as follows: d₁ d₂ d₃ . . . . . d_(p) d_(p+1) d_(p+2) d_(p+3) . . . . . d_(2p) d_(2p+1) d_(2p+2) d_(2p+3) . . . . . d_(3p) d_(3p+1) d_(3p+2) d_(3p+3) . . . . . d_(4p) . . . . . . . . . . . . . . . . . d_(N/p+1) d_(N/p+2) d_(N/p+3) . . . . . d_(N/p+p) ↑ ↑ ↑ ↑ S₁ S₂ S₃ S₀

[0073] 2) Permute the bits within each column block according to the given interleaver type, which can be, in principle, one of any candidate interleavers. For example, applying conditions A and B to each column block; condition C is not necessary under these circumstances.

[0074] 3) Read out the matrix row-by-row in order as shown below to drive the second constituent, whose input is the interleaved output sequence, to the same state as without interleaving the original information sequence.

[0075] Read d_(N/p) + 1 d_(N/p+2) d_(N/p+3) . . . . d_(N/p+p) d_(3p+1) d_(3p+2) d_(3p+3) . . . . d_(4p) d_(2p+1) d_(2p+2) d_(2p+3) . . . . d_(3p) . . . . . . . . . . . . . . . . d_(p+1) d_(p+2) d_(p+3) . . . . d_(2p) d₁ d₂ d₃ . . . . d_(p) ↑ ↑ ↑ ↑ S₁ S₂ S₃ S₀

[0076] While the present invention has been described in terms of the preferred embodiment, other variations which are in the scope of the invention as outlined in the claims below will be apparent to those skilled in the art. 

What is claimed is:
 1. A method of encoding at least one input bit set of N ordered bits with permutation position integers I(k), where k+1 to N comprising the steps of: a. encoding said input bit set using a first encoder having a multi-state register to provide a first output; b. selectively reordering the input bit set using a hybrid S-random interleaver to provide a reordered input bit set, whereby said interleaver reorders said integers I(k) such that once reordered, the value for |I(k)−I(k−nL)| is not evenly divisible by L, where L=2_(m)−1, n is a positive integer defined as k−nL≧0 and nL≦S, and S is an arbitrary predetermined value; and c. encoding said reordered input bit set using a second encoder having a multi-state register to provide a second output; whereby the value of said second encoder register is the same as the value of said first encoder register upon completion of step c.
 2. The method of claim 1, further comprising the steps of: generating a set of tail bits for each said input bit set; and applying said tail bit set to reset the registers of both said first and second encoders.
 3. The method of claim 1 wherein said selective reordering comprises the steps of: a) receiving a plurality of N information bits where N is a positive integer; b) defining the hybrid interleaver frame size N; c) generating random integers I(k) for k from 1 to N that satisfy the conditions: 1) I(k)−I(k−j)|>S, where S is an arbitrary value and j is a positive integer, 0<j≦S and k−j≧0; 2) If nL>S, where L is dependent upon the number of encoder register states and n is a positive integer subject to k−nL≧0, then proceed to step 4; 3) |I(k)−I(k−nL)|≠jL where if not true, repeat steps 1-3; 4) verifying each random integer using k mod 2^(m)−1=I(k)mod 2^(m)−1, where 2^(m) is the number of register states of one of said encoders, if not true, repeat steps 1-4; and d) outputting permuted interleaver data sequence for encoding.
 4. The method of claim 3 wherein step 4 further comprises incrementing the integer bit count k; and if k≠N+1, repeat steps 1-4.
 5. The method of claim 2 further comprising the steps of: a) acknowledging that encoding by said first and second encoder is complete; b) switching inputs to said first and second encoder from an information bit stream and a permuted bit stream respectively to common feedback from said first constituent encoder last stage; and c) incrementing the number of tail bits received from said feedback until said number of tail bits are greater than the number of registers used in said first constituent encoder, and if not, repeat steps b-c.
 6. A transmission method, including encoding at least one input bit set of N ordered bits with permutation position integers I(k) prior to transmission, where k=1 to N, comprising the steps of: a. encoding said input bit set using a first encoder having a multi-state register to provide a first output; b. selectively reordering the input bit set using a hybrid S-random interleaver to provide a reordered input bit set, whereby said interleaver reorders said integers I(k) such that 1-2-1 24.3US once reordered, the value for |(k)−I(k−nL) is not evenly divisible by L, where L=2^(m−)1, n is a positive integer defined as k−nL≧0 and nL≦S, and S is an arbitrary predetermined value; and c. encoding said reordered input bit set using a second encoder having a multi-state register to provide a second output; whereby the value of said second encoder register is the same as the value of said first encoder register upon completion of step c.
 7. The transmission method of claim 6, further comprising the steps of: generating a set of tail bits for each said input bit set; and applying said tail bit set to reset the registers of both said first and second encoders.
 8. The transmission method of claim 5 wherein said selective reordering comprises the steps of: a) receiving a plurality of N information bits where N is a positive integer; b) defining the hybrid interleaver frame size N; c) generating random integers I(k) for k from 1 to N that satisfy the conditions: 1) |I(k)−I(k−j)|>S, where S is an arbitrary value and j is a positive integer, 0<j≦S and k−j≧0; 2) If nL>S, where L is dependent upon the number of encoder register states and n is a positive integer subject to k−nL≧0, is not true, then proceed to step 4; 3) |I(k)−I(k−nL)|≠jL where if not true, repeat steps 1-3; 4) verifying each random integer using k mod 2^(m)−1=I(k)mod 2^(m)−1, where 2^(m) is the number of register states of one of said encoders, if not true, repeat steps 1-4; d) outputting permuted interleaver data sequence for encoding.
 9. The transmission method of claim 8 whereby step 4 further comprises incrementing the integer bit count k; and if k≠N+1, repeating step (c).
 10. The transmission method of claim 7 further comprising the steps of: a) acknowledging that encoding by said first and second encoder is complete; b) switching inputs to said first and second encoders from an information bit stream and a permuted bit stream respectively to common feedback from said first constituent encoder last stage; and c) incrementing the number of tail bits received from said feedback until said number of tail bits are greater than the number of registers used in said first constituent encoder and, if not, repeat steps b-c.
 11. A method of encoding, prior to transmission, an input bit set of N ordered bits with permutation position integers I(k), where k+1 to N comprising the steps of: a. encoding said input bit set using a first encoder having a register to provide a first output; b. selectively reordering the input bit set using an interleaver to provide a reordered input bit set, whereby said interleaver reorders said integers I(k) such that once reordered, the value for |I(k)−I(k−nL)|is not evenly divisible by L, where L=2^(m)−1, n is a positive integer defined as k−nL≧0 and nL≦S, and S is an arbitrary predetermined value; and c. encoding said reordered input bit set using a second encoder having a register to provide a second output; whereby the value of said second encoder register is the same as the value of said first encoder register upon completion of step c. 